Search results for " fueling pump reservation"

showing 2 items of 2 documents

A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations

2021

AbstractThe Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations assumes that, at each station, the number of vehicles simultaneously refueling cannot exceed the number of available pumps. The state-of-the-art solution method, based on the generation of all feasible non-dominated paths, performs well only with up to 2 pumps. In fact, it needs cloning the paths between every pair of pumps. To overcome this issue, in this paper, we propose new path-based MILP models without cloning paths, for both the scenario with private stations (i.e., owned by the fleet manager) and that with public stations. Then, a more efficient cutting plane approach is designed for addressing both…

050210 logistics & transportationMathematical optimization021103 operations researchControl and OptimizationCloning (programming)Alternative fuel vehicles; Fueling pump reservation; Mixed integer linear programming; Vehicle routing problemComputer science05 social sciences0211 other engineering and technologiesComputational intelligence02 engineering and technologyGreen vehicle routingSet (abstract data type)Alternative fuel vehiclesalternative fuels benchmarking clone cells cloning integer programming pumps sensitivity analysis vehicles fueling pump reservation mixed integer linear programming vehicle routing problemMixed integer linear programmingVehicle routing problem0502 economics and businessPath (graph theory)Benchmark (computing)Sensitivity (control systems)Settore MAT/09 - Ricerca OperativaCutting-plane methodFueling pump reservation
researchProduct

The Multi-period Multi-trip Container Drayage Problem with Release and Due Dates

2021

Abstract The Container Drayage Problem (CDP) aims at routing a fleet of trucks, based at a common terminal, to serve customers while minimizing the total travel distance. Each trip starts from and ends at the terminal, and handles a subset of customers. Each customer requires either that a container is picked up or delivered. We introduce a more realistic variant, i.e., the Multi-trip Multi-period CDP with Release and Due Dates (MM-CDP-RDD), in which the planning horizon is composed of several periods (days). On each day, each truck may perform more than one trip respecting the Release and Due Dates (RDD) associated with customer services, corresponding to the first and the last day on whic…

TruckService (business)Routing Multi-trip Vehicle Routing Multi-period Vehicle Routing Combinatorial Benders’ CutsGeneral Computer ScienceOperations researchComputer scienceVehicle routing problem Alternative fuel vehicles Mixed integer linear programming Cutting planes Fueling pump reservationTime horizonManagement Science and Operations ResearchMulti-trip Vehicle RoutingMulti-period Vehicle RoutingSet (abstract data type)Terminal (electronics)Modeling and SimulationContainer (abstract data type)Combinatorial Benders’ CutsSettore MAT/09 - Ricerca OperativaRouting (electronic design automation)Integer programmingRoutingComputers & Operations Research
researchProduct